A heuristic for the two-machine open-shop scheduling problem with transportation times
نویسندگان
چکیده
منابع مشابه
Cat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کاملTwo meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time
In this research, flexible flow shop scheduling with unrelated parallel machines at each stage are considered. The number of stages and machines vary at each stage and each machine can process specific operations. In other words, machines have eligibility and parts have different release times. In addition, the blocking restriction is considered for the problem. Parts should pass each stage and...
متن کاملA Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کاملAn optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
This paper deals with a two-machine open shop scheduling problem. The objective is to minimize the makespan. Jobs arrive over time. We study preemptionresume model, i.e., the currently processed job may be preempted at any moment in necessary and be resumed some time later. Let p1, j and p2, j denote the processing time of a job J j on the two machines M1 and M2, respectively. Bounded processin...
متن کاملTwo machine mixed shop scheduling problem with controllable machine speeds
This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machines A, B and n jobs each of which consists of two operations. One operation is to be processed on machine A and the other on machine B. All jobs are open shop type, i.e., processing order of two operations is not specified and so processing o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00115-8